Delaunay triangulation of imprecise points in linear time after preprocessing
نویسندگان
چکیده
منابع مشابه
Delaunay Triangulation of Imprecise Points Simplified and Extended
Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collectionR of input regions known in advance. Building on recent work by Löffler and Snoeyink [21], we show how to leverage our knowledge of R for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different s...
متن کاملDelaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time
We propose a new algorithm that preprocess a set of n disjoint unit disks to be able to compute the Delaunay triangulation in O(n) expected time. Conversely to previous similar results, our algorithm is actually faster than a direct computation in O(n log n) time. Key-words: Delaunay triangulation, uncertainties, randomization This work is partly supported by ANR grant Triangles (ANR-07-BLAN-03...
متن کاملDelaunay Triangulation of Moving Points
Delaunay triangulation and its dual structure Voronoi diagram represent a multi-purpose data structures which are widely used in computational geometry. Using these structures for sets of moving data is also relatively well-known and the general approaches have already been discovered. This paper focuses on the rarely discussed problem computing of the topological events e.g. the exact times of...
متن کاملComputing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside the circle determined by any other three points. We address the problem of formulating the in-circle test when the coordinates of the planar points are given only up to a given precision, which is usually the case in pra...
متن کاملPreprocessing Imprecise Points and Splitting Triangulations
Traditional algorithms in computational geometry assume that the input points are given precisely. In practice, data is usually imprecise, but information about the imprecision is often available. In this context, we investigate what the value of this information is. We show here how to preprocess a set of disjoint regions in the plane of total complexity n in O(n logn) time so that if one poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2010
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.12.007